Scheduling in Proportionate Flowshops
نویسنده
چکیده
It is well known that except in the case of makespan problems, there are hardly any analytical results for flowshop problems. This paper considers of a class of flowshop problems where job processing time at a machine is proportionate to the processing time on the first machine. We show that for the pre-emptive version of the problem, in order to minimize any regular measure of performance, it is sufficient to consider permutation schedules. Also, results for various other measures are derived* A characterization of the optimal solution for the weighed tardiness problem is derived which is analogous to its counterpart in the single machine case. It is indicated as how this characterization nay be used to develop heuristics for flowshop problems.
منابع مشابه
A Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints
This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regardi...
متن کاملAlgorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and parallel machine problems by considering stages with parallel machines instead of having one single machine per stage. We also investigate the flexible version where stage skipping might occur, i.e., not all stages must be vi...
متن کاملGenetic Algorithms and Flowshop Scheduling: Towards the Development of a Real-Time Process Control System
Scheduling in chemical flowshops is one of a number of important industrial problems which are potentially amenable to solution using the genetic algorithm. However the problem is not trivial: flowshops run continuously, and for efficient operation those controlling them must be able to adjust the order in which products are made as new requests are received. In addition, there are in principle...
متن کاملReal-time order flowtime estimation methods for two-stage hybrid flowshops
In this study, we consider a problem of estimating order flowtimes in two-stage hybrid flowshops, where orders arrive dynamically and various scheduling schemes can be used. To solve the problem, we devise several order flowtime estimation methods, and each method is specific to the scheduling scheme used in the shop. Whenever an order arrives, the flowtime of the order is estimated by using on...
متن کامل